Strongly Inequivalent Representations and Tutte Polynomials of Matroids
نویسندگان
چکیده
We develop constructive techniques to show that non-isomorphic 3-connected matroids that are representable over a fixed finite field and that have the same Tutte polynomial abound. In particular, for most prime powers q, we construct infinite families of sets of 3-connected matroids for which the matroids in a given set are non-isomorphic, are representable over GF(q), and have the same Tutte polynomial. Furthermore, the cardinalities of the sets of matroids in a given family grow exponentially as a function of rank, and there are many such families. In Memory of Gian-Carlo Rota
منابع مشابه
Tutte Polynomials of Generalized Parallel Connections
We use weighted characteristic polynomials to compute Tutte polynomials of generalized parallel connections in the case in which the simplification of the maximal common restriction of the two constituent matroids is a modular flat of the simplifications of both matroids. In particular, this includes cycle matroids of graphs that are identified along complete subgraphs. We also develop formulas...
متن کاملAn Introduction to Transversal Matroids
1. Prefatory Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2. Several Perspectives on Transversal Matroids . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.1. Set systems, transversals, partial transversals, and Hall’s theorem . . . . . . . . 2 2.2. Transversal matroids via matrix encodings of set systems . . . . . ....
متن کاملLattice path matroids: enumerative aspects and Tutte polynomials
Fix two lattice paths P and Q from ð0; 0Þ to ðm; rÞ that use East and North steps with P never going above Q: We show that the lattice paths that go from ð0; 0Þ to ðm; rÞ and that remain in the region bounded by P and Q can be identified with the bases of a particular type of transversal matroid, which we call a lattice path matroid. We consider a variety of enumerative aspects of these matroid...
متن کاملParametrized Tutte Polynomials of Graphs and Matroids
We generalize and unify results on parametrized and coloured Tutte polynomials of graphs and matroids due to Zaslavsky, and Bollobás and Riordan. We give a generalized Zaslavsky– Bollobás–Riordan theorem that characterizes parametrized contraction–deletion functions on minor-closed classes of matroids, as well as the modifications necessary to apply the discussion to classes of graphs. In gener...
متن کاملOn Totally Free Expansions of Matroids
The aim of this paper is to give insight into the behaviour of inequivalent representations of 3{connected matroids. An element x of a matroid M is xed if there is no extension M 0 of M by an element x 0 such that fx;x 0 g is independent and M 0 is unaltered by swapping the labels on x and x 0. When x is xed, a representation of M nx extends in at most one way to a representation of M. A 3{conn...
متن کامل